31![Optimising Terminological Reasoning for Expressive Description Logics Dmitry Tsarkov, Ian Horrocks and Peter F. Patel-Schneider School of Computer Science University of Manchester, UK, and Optimising Terminological Reasoning for Expressive Description Logics Dmitry Tsarkov, Ian Horrocks and Peter F. Patel-Schneider School of Computer Science University of Manchester, UK, and](https://www.pdfsearch.io/img/1d78f4308cad86ceff0edede578a47f3.jpg) | Add to Reading ListSource URL: www.cs.man.ac.ukLanguage: English - Date: 2007-07-26 07:53:30
|
---|
32![The Set Constraint/CFL Reachability Connection in Practice John Kodumal Alex Aiken The Set Constraint/CFL Reachability Connection in Practice John Kodumal Alex Aiken](https://www.pdfsearch.io/img/89ce8d9948659c436d25566c9461eec1.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2004-04-22 02:37:00
|
---|
33![Course Notes for Math 320: Fundamentals of Mathematics Chapter 4: Relations, Equivalence Relations and Congruence. March 14, 2006 Course Notes for Math 320: Fundamentals of Mathematics Chapter 4: Relations, Equivalence Relations and Congruence. March 14, 2006](https://www.pdfsearch.io/img/730024c24ab1d6ee9ce1bf0fe00466a9.jpg) | Add to Reading ListSource URL: www.csun.eduLanguage: English - Date: 2006-03-14 12:05:52
|
---|
34![1993 Paper 11 Question 11 Discrete Mathematics Let A be a non-empty set, and ≺ be a relation on A. What is meant by saying that (A, ≺) is a partially ordered set? [3 marks] 1993 Paper 11 Question 11 Discrete Mathematics Let A be a non-empty set, and ≺ be a relation on A. What is meant by saying that (A, ≺) is a partially ordered set? [3 marks]](https://www.pdfsearch.io/img/8059e2baffac7166b1f31bb60520bee7.jpg) | Add to Reading ListSource URL: www.cl.cam.ac.ukLanguage: English - Date: 2014-06-09 10:16:52
|
---|
35![Inductively Finding a Reachable State Space Over-Approximation Michael L. Case Alan Mishchenko Inductively Finding a Reachable State Space Over-Approximation Michael L. Case Alan Mishchenko](https://www.pdfsearch.io/img/dcc991393fd94980788dd237a780b94c.jpg) | Add to Reading ListSource URL: www.bvsrc.orgLanguage: English - Date: 2006-05-01 16:01:54
|
---|
36![](https://www.pdfsearch.io/img/aff7a87602347949b9c0042c7d92b4f5.jpg) | Add to Reading ListSource URL: research.microsoft.comLanguage: English - Date: 2009-07-21 19:18:57
|
---|
37![Event Matching Using the Transitive Closure of Dependency Relations Daniel M. Bikel and Vittorio Castelli IBM T. J. Watson Research Center 1101 Kitchawan Road Yorktown Heights, NY 10598 {dbikel,vittorio}@us.ibm.com Event Matching Using the Transitive Closure of Dependency Relations Daniel M. Bikel and Vittorio Castelli IBM T. J. Watson Research Center 1101 Kitchawan Road Yorktown Heights, NY 10598 {dbikel,vittorio}@us.ibm.com](https://www.pdfsearch.io/img/28ab6440c74773a35b9254d59312c296.jpg) | Add to Reading ListSource URL: www.aclweb.orgLanguage: English - Date: 2010-06-15 03:24:25
|
---|
38![15 Alice: Sergio: Alice: Riccardo: Vittorio: 15 Alice: Sergio: Alice: Riccardo: Vittorio:](https://www.pdfsearch.io/img/92da643fc3b9dc488f82a4b2fd28db2f.jpg) | Add to Reading ListSource URL: webdam.inria.frLanguage: English - Date: 2010-02-12 06:45:46
|
---|
39![Termination Analysis with Compositional Transition Invariants? Daniel Kroening1 , Natasha Sharygina2,4 , Aliaksei Tsitovich2 , and Christoph M. Wintersteiger3 1 Termination Analysis with Compositional Transition Invariants? Daniel Kroening1 , Natasha Sharygina2,4 , Aliaksei Tsitovich2 , and Christoph M. Wintersteiger3 1](https://www.pdfsearch.io/img/6edcf67a1028f29ab9ebda8b521cd16a.jpg) | Add to Reading ListSource URL: www.winterstiger.atLanguage: English - Date: 2010-04-30 09:51:18
|
---|
40![Finding Botnets Using Minimal Graph Clusterings Peter Haider [removed] Tobias Scheffer [removed] Finding Botnets Using Minimal Graph Clusterings Peter Haider [removed] Tobias Scheffer [removed]](https://www.pdfsearch.io/img/2c3f7e7c9040060bc8d18be9249cdbcf.jpg) | Add to Reading ListSource URL: icml.ccLanguage: English - Date: 2012-06-07 13:20:18
|
---|